Languages of R-trivial monoids
نویسندگان
چکیده
منابع مشابه
Primitive orthogonal idempotents for R-trivial monoids
We construct a recursive formula for a complete system of primitive orthogonal idempotents for any Rtrivial monoid. This uses the newly proved equivalence between the notions of R-trivial monoid and weakly ordered monoid. Résumé. Nous construisons une formule récursive pour un système complet d’idempotents orthogonaux primitifs pour tout monoı̈de R-trivial. Nous employons une nouvelle équivalenc...
متن کاملThe Join of the Varieties of R-trivial and L-trivial Monoids via Combinatorics on Words
The join of two varieties is the smallest variety containing both. In finite semigroup theory, the varieties of R-trivial and L-trivial monoids are two of the most prominent classes of finite monoids. Their join is known to be decidable due to a result of Almeida and Azevedo. In this paper, we give a new proof for Almeida and Azevedo’s effective characterization of the join of R-trivial and L-t...
متن کاملOrdered monoids and J-trivial monoids
In this paper we give a new proof of the following result of Straubing and Thérien: every J -trivial monoid is a quotient of an ordered monoid satisfying the identity x ≤ 1. We will assume in this paper that the reader has a basic background in finite semigroup theory (in particular, Green’s relations and identities defining varieties) and in computer science (languages, trees, heaps). All semi...
متن کاملSyntactic Complexity of R- and J-Trivial Regular Languages
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of Rand J -trivial regular languages, and prove that n! and ⌊e(n −...
متن کاملOrdered Monoids: Languages and Relations
We give a finite axiomatization for the variety generated by relational, integral ordered monoids. As a corollary we get a finite axiomatization for the language interpretation as well.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1980
ISSN: 0022-0000
DOI: 10.1016/0022-0000(80)90003-3